|
Martin Edward Dyer (born 16 July 1946 in Ryde, Isle of Wight, England) is a professor in the School of Computing at the University of Leeds, Leeds, England. He graduated from the University of Leeds in 1967, obtained his MSc from Imperial College London in 1968 and his PhD from the University of Leeds in 1979. His research interests lie in theoretical computer science, discrete optimization and combinatorics. Currently, he focuses on the complexity of counting and the efficiency of Markov chain algorithms for approximate counting. ==Key contributions== Four key contributions made by Martin Dyer are: (1) - polynomial time algorithm for approximating the volume of convex bodies (with Alan Frieze and Ravindran Kannan)〔 〕 (2) - linear programming in fixed dimensions (3) - the path coupling method for proving mixing of Markov chains (with Russ Bubley)〔 〕 (4) - complexity of counting constraint satisfaction problems 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Martin Dyer」の詳細全文を読む スポンサード リンク
|